标准模型下强安全的无证书签密方案

首先指出近期提出的一种无证书签密方案易受到公钥替换攻击,并给出了相关攻击实例。进而提出一种新的无双线性对的无证书签密方案,通过对实体的无证书公钥和托管公钥进行独立的密码学验证,确保了新方案不遭受与现有方案类似的公钥替换攻击。在标准模型下,新方案被证明是安全的,能够实现无证书签密的不可伪造性和机密性。对比分析表明,新方案在确保强安全性的同时具有较好的计算性能。     

传感器网络高效密钥建立方案

随着时间的推移,传感器网络中正常工作的节点越来越少。为了确保网络正常工作,必须适时地添加新节点。针对传感器网络,提出了一个高效的密钥建立方案。该方案构造了n个相互独立的子密钥池,两相邻子密钥池之间存在联系密钥。第j次部署的传感器节点只从第j个子密钥池中选取密钥。理论分析及模拟结果表明与使用固定密钥池的方案相比,该方案的抗毁性显著提高。     

多变量分支混沌签名体制

针对量子计算机对现有密码算法的威胁,结合多变量公钥体制和混沌系统,提出一种能抵抗量子算法的分支密码体制。体制的中心映射有两个分支,分支一使用传统多变量公钥密码体制,分支二使用混沌密码体制,将两分支的输出结果相加,最后通过仿射变换将中心映射进行隐藏。利用分支结构提高计算效率,利用混沌系统克服传统多变量公钥密码体制的缺点以增强安全性,适用于各类设备进行签名运算。     

On the implication problem for cardinality constraints and functional dependencies

In database design, integrity constraints are used to express database semantics. They specify the way by that the elements of a database are associated to each other. The implication problem asks whether a given set of constraints entails further constraints. In this paper, we study the finite implication problem for cardinality constraints. Our main result is a complete characterization of closed sets of cardinality constraints. Similar results are obtained for constraint sets containing cardinality constraints, but also key and functional dependencies. Moreover, we construct Armstrong databases for these constraint sets, which are of special interest for example-based deduction in database design.     

Design and Implementation of a PKI-Based End-to-End Secure Infrastructure for Mobile E-Commerce

The popularity of handheld mobile devices and deployment of the public key infrastructure in many parts of the world have led to the development of electronic commerce on mobile devices. For the current version of mobile phones, the main challenge is the limited computing capacity on these devices for PKI-based end-to-end secure transactions. This paper presents a new architecture and protocol for authentication and key exchange as well as the supporting infrastructure that is suitable for the mobile phone environment. The system requirements and our solutions in addressing these requirements in the restrictive environment are discussed. An evaluation of the system performance is also included. The system has been implemented and is supporting some real-life applications.     

Efficient Tate pairing computation using double-base chains

Pairing-based cryptosystems have developed very fast in the last few years. The efficiencies of these cryptosystems depend on the computation of the bilinear pairings, In this paper, a new efficient algorithm based on double-base chains for computing the Tate pairing is proposed for odd characteristic p 〉 3. The inherent sparseness of double-base number system reduces the computational cost for computing the Tate pairing evidently. The new algorithm is 9% faster than the previous fastest method for the embedding degree k = 6.     

无线传感器网络密钥管理方案综述

无线传感器网络密钥管理方案是无线传感器网络研究的热点问题之一。本文结合无线传感器网络的特点,分析了无线传感器网络中密钥管理方案的安全要求和评价指标,介绍了一些主要的密钥管理方案,并对它们进行了分析和比较,最后指出了研究方向。     

接收方不可抵赖的数字签名方案

数字签名作为一项重要的数据安全技术,在保证网络通信数据的完整性、保密性和不可抵赖性方面发挥着重要的作用,并且随着网络技术的发展和普及,将会发挥更大的作用,该文首先介绍数字签名的理论基础:公开密钥体制、单向散列函数、CA机构和证书,然后针对特定的应用场合,设计出具有特定功能的数字签名方案——双方均不可抵赖的数字签名方案。     

办公自动化系统中的数据加密传输

本文讨论了采用端到端的加密传输技术在局域网办公自动化系统中应用,在系统中增加加密模块实现文件的加密传输．传输采用C／S模型。该加密传输技术已在实际应用中得到了验证,取得了良好效果。     

现代密码学上的弹性函数综述

本文介绍了在容错分布、量子密码学中的密钥分配以及流密码中的随机序列产生等领域都有着广泛应用的一类多输出布尔函数——弹性函数。弹性函数和0,1上多维空间的正交分划（一个正交矩阵组）是一致的。在此基础上,介绍了弹性函数的正交分划的递归构造方法和简单计数。